翻訳と辞書 Words near each other ・ Memory T cell ・ Memory Tapes ・ Memory Technology Device ・ Memory test ・ Memory tester ・ Memory timings ・ Memory type range register ・ Memory unit ・ Memory virtualization ・ Memory work ・ Memory, Sorrow, and Thorn ・ Memory-disk synchronization ・ Memory Bank (UK game show) ・ Memory Banks (comic strip) ・ Memory barrier ・ Memory bound function ・ Memory box ・ Memory Boy ・ Memory Bridge ・ Memory buffer register ・ Memory bus ・ Memory card ・ Memory card compatibility chart ・ Memory card connector ・ Memory card reader ・ Memory cell ・ Memory cell (binary) ・ Memory cells (motor cortex) ・ Memory Chapel ・ Memory clinic Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Memory bound function ： ウィキペディア英語版 Memory bound function Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of memory required to hold data. In other words, the limiting factor of solving a given problem is the memory access speed. The application of memory bound functions could prove to be valuable in preventing spam, which has become a problem of epidemic proportions on the Internet. ==Memory bound functions and memory functions== Memory bound functions and memory functions are related in that both involve extensive memory access, but a distinction exists between the two. Memory functions use a dynamic programming technique called memoization in order to relieve the inefficiency of recursion that might occur. It is based on the simple idea of calculating and storing solutions to subproblems so that the solutions can be reused later without recalculating the subproblems again. The best known example that takes advantage of memoization is an algorithm that computes the Fibonacci numbers. The following pseudocode illustrates an algorithm that uses memoization, which runs in linear CPU time: Fibonacci (n) Fibonacci_Results (results, n) Compare the above to an algorithm that uses recursion, which runs in exponential CPU time: Recursive_Fibonacci (n) While the recursive algorithm is simpler and more elegant than the algorithm that uses memoization, the latter has a significantly lower time complexity than the former. The term "memory bound function" has surfaced only recently and is used principally to describe a function that uses XOR and consists of a series of computations in which each computation depends on the previous computation. Whereas memory functions have long been an important actor in improving time complexity, memory bound functions have seen far fewer applications. Recently, however, scientists have proposed a method using memory bound functions as a means to discourage spammers from abusing resources, which could be a major breakthrough in that area. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Memory bound function」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.